A note on approximating snowflake metrics by trees
نویسنده
چکیده
prove that the tree construction of Fakcharoenphol, Rao, and Talwar [2] can be used to approximate snowflake metrics by trees with expected distortion bounded independently of the size of the metric space. The constant of distortion we derive depends linearly on the dimension of the metric space. We also present an algorithm for building a single tree whose cost is linear in the problem size. Approved for public release: distribution is unlimited.
منابع مشابه
Approximating snowflake metrics by trees
Article history: Received 25 January 2015 Received in revised form 4 November 2015 Accepted 7 October 2016 Available online xxxx Communicated by Charles K. Chui MSC: 68W05 68W25 05C05 54E35
متن کاملOn the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)
This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.
متن کاملNew Metrics for Phylogenies
In this paper we propose two new metrics on the space of phylogenetic trees. The problem of determining how distant two trees are from each other is crucial because many various methods have been proposed for reconstructing phylogenetic trees from data. These techniques (in fact often heuristics) applied to the same data results in different trees. We investigate the basic properties of new met...
متن کاملA NOTE ON THE EQUISEPARABLE TREES
Let T be a tree and n_{l}(eIT) and n_{2}(eIT) denote the number of vertices of T, lying on the two sides of the edge e. Suppose T_{l} and T_{2} are two trees with equal number of vertices, e in T_{1} and f in T_{2}. The edges e and f are said to be equiseparable if either n_{l}(eIT_{I}) = n_{l}(fIT_{2}) or n_{l}(eIT_{I}) = n_{2}(fIT_{2}). If there is an one-to-one correspondence between the ver...
متن کاملNotes on Distance- Based Coding Methods for Binary Trees
This note introduces a new coding method for binary trees in which the code item corresponding to a node equals node's distance from the left arm of the tree according to the metrics defined by the tree. The new coding method is compared with previously known methods. Moreover, we establish a connection between distance-based methods and a recently introduced method by Johnsen.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014